Computer Science for IGCSE & O level - Algorithm Design And Problem Solving (Section 10 - No. 46)
In the bubble sort algorithm, how is the sorting achieved?
By comparing and swapping adjacent elements.
By selecting the smallest element in each pass.
By recursively splitting the list into smaller sub-lists.
By randomly swapping elements.
Explication
Bubble sort works by comparing adjacent elements and swapping them if they are in the wrong order.